The Schur Algorithm and its Applications
نویسندگان
چکیده
The Schur algorithm and its times-domain counterpart, the fast Cholseky recursions, are some efficient signal processing algorithms which are well adapted to the study of inverse scattering problems. These algorithms use a layer stripping approach to reconstruct a lossless scattering medium described by symmetric two-component wave equations which model the interaction of right and left propagating waves. In this paper, the Schur and fast Cholesky recursions are presented and are used to study several inverse problems such as the reconstruction of nonuniform lossless transmission lines, the inverse problem for a layered acoustic medium, and the linear least-squares estimation of stationary stochastic processes. The inverse scattering problem for asymmetric two-component wave equations corresponding to lossy media is also examined and solved by using two coupled sets of Schur recursions. This procedure is then applied to the inverse problem for lossy transmission lines.
منابع مشابه
SIMULATED ANNEALING ALGORITHM FOR SELECTING SUBOPTIMAL CYCLE BASIS OF A GRAPH
The cycle basis of a graph arises in a wide range of engineering problems and has a variety of applications. Minimal and optimal cycle bases reduce the time and memory required for most of such applications. One of the important applications of cycle basis in civil engineering is its use in the force method to frame analysis to generate sparse flexibility matrices, which is needed for optimal a...
متن کاملThe structure of a pair of nilpotent Lie algebras
Assume that $(N,L)$, is a pair of finite dimensional nilpotent Lie algebras, in which $L$ is non-abelian and $N$ is an ideal in $L$ and also $mathcal{M}(N,L)$ is the Schur multiplier of the pair $(N,L)$. Motivated by characterization of the pairs $(N,L)$ of finite dimensional nilpotent Lie algebras by their Schur multipliers (Arabyani, et al. 2014) we prove some properties of a pair of nilpoten...
متن کاملEffective implementation of the weak Galerkin finite element methods for the biharmonic equation
The weak Galerkin (WG) methods have been introduced in [11, 16] for solving the biharmonic equation. The purpose of this paper is to develop an algorithm to implement the WG methods effectively. This can be achieved by eliminating local unknowns to obtain a global system with significant reduction of size. In fact this reduced global system is equivalent to the Schur complements of the WG metho...
متن کاملA Superfast Toeplitz Solver with Improved Numerical Stability
This paper describes a new O(n log(n)) solver for the positive definite Toeplitz system Tx = b. Instead of computing generators for the inverse of T , the new algorithm adjoins b to T and applies a superfast Schur algorithm to the resulting augmented matrix. The generators of this augmented matrix and its Schur complements are used by a divide-and-conquer block back-substitution routine to comp...
متن کاملA Schur Algorithm for Computing Matrix pth Roots
Any nonsingular matrix has pth roots. One way to compute matrix pth roots is via a specialized version of Newton’s method, but this iteration has poor convergence and stability properties in general. A Schur algorithm for computing a matrix pth root that generalizes methods of Björck and Hammarling [Linear Algebra Appl., 52/53 (1983), pp. 127–140] and Higham [Linear Algebra Appl., 88/89 (1987),...
متن کامل